Using an interior point method in a branch and bound algorithm for integer programming July
نویسنده
چکیده
This paper describes an experimental code that has been developed to solve zero one mixed integer linear programs The experimental code uses a primal dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method Computational results for a number of test problems are provided
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملUsing an Interior Point Method in a Branch and Bound Algorithm for Integer Programming
This paper describes an experimental code that has been developed to solve zero-one mixed integer linear programs. The experimental code uses a primal{dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method. Computational results for a number of test problems are provided.
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملMixed integer nonlinear programming using interior-point methods
In this paper, we outline a bilevel approach for solving mixed integer nonlinear programming problems. The approach combines a branch-and-bound algorithm in the outer iterations and an infeasible interior-point method in the inner iterations. We report on the details of the implementation, including the efficient pruning of the branch-and-bound tree via equilibrium constraints, warmstart strate...
متن کاملInterior Point Algorithms for Integer Programming
An algorithm for solving linear programming problems can be used as a subroutine in methods for more complicated problems. Such methods usually involve solving a sequence of related linear programming problems, where the solution to one linear program is close to the solution to the next, that is, it provides a warm start for the next linear program. The branch and cut method for solving intege...
متن کامل